Variable-to-fixed length codes provide better large deviations performance than fixed-to-variable length codes
نویسندگان
چکیده
It is proved that for finite-alphabet, finite-state unifilar sources, variable-to-fixed length codes provide better large deviations performance of the empirical compression ratio, than fixed-to-variable Manuscript received March 21, 1990; revised March 6, 1991. N. Merhav was with AT&T Bell Laboratories, Murray Hill, NJ. He is now with the Department of Electrical Engineering, Technion-Israel Institute of Technology, Haifa 32000, Israel. D. L. Neuhoff was with AT&T Bell Laboratories, Murray Hill, NJ. He is now with the Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI 48109. I ‘ . 1 IEEE Log Number 9102762. length codes. It is shown how to construct a universal variable-to-fixed length code that achieves the optimal performance.
منابع مشابه
Universal variable-to-fixed length source codes
A universal variable-to-fixed length algorithm for binary memoryless sources which converges to the entropy of the source at the optimal rate is known. We study the problem of universal variable-to-fixed length coding for the class of Markov sources with finite alphabets. We give an upper bound on the performance of the code for large dictionary sizes and show that the code is optimal in the se...
متن کاملVariable-to-fixed length codes are better than fixed-to-variable length codes for Markov sources
-It is demonstrated that for finite-alphabet, Kth order ergodic Markov Sources (i.e., memory of K letters), a variable-to-fixed code is better than the best fixed-to-variable code (Huffman code). It is shown how to construct a variable-to-fixed length code for a Kth order ergodic Markov source, which compresses more effectively than the best fixed-to-variable code (Huffman code).
متن کاملUniversal Variable-to-Fixed Length Codes Achieving Optimum Large Deviations Performance for Empirical Compression Ratio
This paper clari es two variable-toxed length codes which achieve optimum large deviations performance of empirical compression ratio. One is Lempel-Ziv code with xed number of phrases, and the other is an arithmetic code with xed codeword length. It is shown that Lempel-Ziv code is asymptotically optimum in the above sense, for the class of nite-alphabet and nite-state sources, and that the ar...
متن کاملSource coding exponents for zero-delay coding with finite memory
Fundamental limits on the source coding exponents (or large deviations performance) of zero-delay finite-memory (ZDFM) lossy source codes are studied. Our main results are the following. For any memoryless source, a suitably designed encoder that time-shares (at most two) memoryless scalar quantizers is as good as any time-varying fixed-rate ZDFM code, in that it can achieve the fastest exponen...
متن کاملA Comparative Complexity Study of Fixed-to-variable Length and Variable-to-fixed Length Source Codes
In this paper we present an analysis of the storage complexity of Huffman codes, Tunstall codes and arithmetic codes in various implementations and relate this to the achieved redundancies. It turns out that there exist efficient implementations of both Huffman and Tunstall codes and that their approximations result in arithmetic codes. Although not optimal, the arithmetic codes still have a be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 38 شماره
صفحات -
تاریخ انتشار 1992